Chi-boundedness of graph classes excluding wheel vertex-minors
نویسندگان
چکیده
منابع مشابه
Excluding infinite minors
Robertson, N., P. Seymour and R. Thomas, Excluding infinite minors, Discrete Mathematics 95 (1991) 303-319. Let K be an infinite cardinal, and let H be either a complete graph with K vertices, or a tree in which every vertex has valency K. What can we say about graphs G which (i) have no minor isomorphic to H, or (ii) contain no sub graph which is a subdivision of H? These four questions are an...
متن کاملVertex elimination orderings for hereditary graph classes
We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose, Tarjan and Lueker, one of its properties discovered by Berry and Bordat, and a local decomposition property of graphs discovered by Maffray, Trotignon and Vu...
متن کاملA characterization of some graph classes using excluded minors
In this article we present a structural characterization of graphs without K5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.
متن کاملApproximation algorithms for classes of graphs excluding single-crossing graphs as minors
Many problems that are intractable for general graphs allow polynomial-time solutions for structured classes of graphs, such as planar graphs and graphs of bounded treewidth. In this paper, we demonstrate structural properties of larger classes of graphs and show how to exploit the properties to obtain algorithms. The classes considered are those formed by excluding as a minor a graph that can ...
متن کاملLinear Kernels on Graphs Excluding Topological Minors
We show that problems that have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of H-topological-minor free graphs, for an arbitrary fixed graph H . This builds on earlier results by Bodlaender et al. on graphs of bounded genus [2] and by Fomin et al. on H-minor-free graphs [9]. Our framework encompasses several problems, the prominent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.06.045